منابع مشابه
Further Results on Digital Search Trees
In this paper distribution results are proved on the cost of insertion in digital search trees, (binary) tries and Patricia tries. A method from the calculus of finite differences is used to achieve asymptotic results.
متن کاملSome Further Results on Digital Search Trees
Our purpose in this paper is the study of digital search trees, (binary) tries and Patricia tries ; a wealth of information about these. important data structures can be found in Knuth's book (2] ; compare also Flajolet and Sedgewick (1] . Considering digital search trees, we assume that each item has a key being an infinite sequence of 0 and 1, where 0 means "go left" and 1 means "go right", u...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملFurther Results on Monoids Acting on Trees
This paper further develops the theory of arbitrary semigroups acting on trees via elliptic mappings. A key tool is the Lyndon-Chiswell length function L for the semigroup S which allows one to construct a tree T and an action of S on T via elliptic maps. Improving on previous results, the length function of the action will also be L.
متن کاملDigital Search Trees Revisited
Several algorithms have been proposed which build search trees using digital properties of the search keys. A general approach to the study of the average case performance of such algorithms is discussed, with particular attention to the analysis of the digital search tree structures of Coffman and Eve. Specifically, the method leads to the solution of a problem left open by Knuth, finding the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90023-0